On strictly Deza graphs with parameters (n,k,k−1,a)
نویسندگان
چکیده
منابع مشابه
A directed version of Deza graphs - Deza digraphs
As a generalization of Deza graphs, we introduce Deza digraphs and describe the basic theory of these graphs. We also prove the necessary and sufficient conditions when a weakly distance-regular digraph is a Deza digraph.
متن کاملOn strictly Chordality-k graphs
Strictly Chordality-k graphs (SC k graphs) are graphs which are either cycle free or every induced cycle is exactly k, for some fixed k, k ≥ 3. Note that k = 3 and k = 4 are precisely the Chordal graphs and Chordal Bipartite graphs, respectively. In this paper, we initiate a structural and an algo-rithmic study of SC k , k ≥ 5 graphs.
متن کاملDeza Graphs: A Generalization of Strongly Regular Graphs
We consider the following generalization of strongly regular graphs. A graph G is a Deza graph if it is regular and the number of common neighbors of two distinct vertices takes on one of two values (not necessarily depending on the adjacency of the two vertices). We introduce several ways to construct Deza graphs, and develop some basic theory. We also list all diameter two Deza graphs which a...
متن کاملDeza digraphs
We consider a directed version of Deza graphs. A digraph is said to be a Deza digraph if it is regular and the number of common out-neighbors of any two distinct vertices takes on at most two values. We introduce some constructions and develop some basic theory. In particular, constructions from Cayley digraphs, graph lexicograph products and graph directed products are described. Moreover, we ...
متن کاملDeza digraphs II
A necessary and sufficient condition is obtained for the lexicographic (resp. categorical) product from a Deza digraph to another to be also a Deza digraph. Moreover, constructions of Deza digraphs from the incidence structures associated with vector spaces (resp. distance-regular graphs) are given.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: European Journal of Combinatorics
سال: 2019
ISSN: 0195-6698
DOI: 10.1016/j.ejc.2018.07.011